A Random Permutation Model Arising in Chemistry
نویسندگان
چکیده
منابع مشابه
A Random Permutation Model Arising in Chemistry
We study a model arising in chemistry where n elements numbered 1, 2, . . . , n are randomly permuted and if i is immediately to the left of i + 1 then they become stuck together to form a cluster. The resulting clusters are then numbered and considered as elements, and this process keeps repeating until only a single cluster is remaining. In this article we study properties of the distribution...
متن کاملTests of Hypotheses Arising In the Correlated Random Coefficient Model.
This paper examines the correlated random coefficient model. It extends the analysis of Swamy (1971), who pioneered the uncorrelated random coefficient model in economics. We develop the properties of the correlated random coefficient model and derive a new representation of the variance of the instrumental variable estimator for that model. We develop tests of the validity of the correlated ra...
متن کاملDistinguishing a truncated random permutation from a random function
An oracle chooses a function f from the set of n bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an n-bit string w, the oracle computes f(w), truncates the m last bits, and returns only the first n −m bits of f(w). How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from ...
متن کاملThe Expected Order of a Random Permutation
Let fin be the expected order of a random permutation, that is, the arithmetic mean of the orders of the elements in the symmetric group Sn. We prove that log/in ~ c\/(n/\ogn) as n -> oo, where c = 2 / ( 2 I °° log log I — — I dt\ 1. Overview If a is a permutation on n letters, let Nn{a) be the order of a as a group element. For a typical permutation, Nn is about n . To make this precise, we qu...
متن کاملKey Based Random Permutation (KBRP)
This study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random permutation comes from the fact that the probability of gettin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2008
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200004976